Date: Wed, 11 Dec 1996 22:34:51 GMT
Server: NCSA/1.5
Content-type: text/html
Last-modified: Wed, 11 Sep 1996 17:13:40 GMT
Content-length: 1523

<HTML>

<HEAD>
<TITLE>CS 302 Section 70, Syllabus - Weeks 12-15</TITLE>
</HEAD>

<BODY>

<H2><!WA0><!WA0><!WA0><A HREF="http://www.cs.wisc.edu/~tick/cs302.html#syllabus" ><!WA1><!WA1><!WA1><IMG SRC="http://www.cs.wisc.edu/~tick/icons/arrowleft.gif" WIDTH=15 HEIGHT=15></A> Syllabus - Weeks 12-15 (Final Exam)</H2>

<HR>
<H3>Week 12</H3>
<DL>
   <DT>Topic:
   <DD>Matrices - multiplication, inversion, determinant, etc.<P>

   <DT>Text:
   <DD>None - refer to Program #6 instead.<P>
</DL>


<HR>

<H3>Week 13</H3>
<DL>
   <DT>Topic:
   <DD>More searching and sorting arrays. Selection sort, bubble sort, binary search, improved binary search.<P>

   <DT>Text:
   <DD>Chp. 6.1 - 6.6, 6.8 and lecture notes.<P>
</DL>

<HR>

<H3>Week 14</H3>
<DL>
   <DT>Topic:
   <DD>Numerical techniques - finding the roots to an equation.  Bisection method, Regula-Falsi method, Newton's method.<P>

   <DT>Text:
   <DD>12.1<P>

   <DT>Due:
   <DD>Program #6 (5%)<P>
</DL>

<HR>

<H3>Week 15</H3>
<DL>
   <DT>Topic:
   <DD>Numerical techniques - integration.  Reimann sums (quadrilateral approximation), Simpson's Rule (quadratic approximation). Double-precision and complex numbers.<P>

   <DT>Text:
   <DD>12.5, 12.7<P>

   <DT>Due:
   <DD>Program #7 (5%)<P>

   <DT>Exam:
   <DD><STRONG>Final Exam</STRONG> (May 13)<P>

</DL>

</BODY>

<HR>

<ADDRESS>
<H5>Copyright &copy 1996 Modified from<!WA2><!WA2><!WA2><A HREF="http://www.cs.wisc.edu/~tick/tick.html">Jeff Lampert</A> (<!WA3><!WA3><!WA3><A HREF="mailto:tick@cs.wisc.edu">tick@cs.wisc.edu</A>).  Last modified September 11, 1996.</H5>
</ADDRESS>

</HTML>
